A lexicographic shellability characterization of geometric lattices

نویسندگان

  • Ruth Davidson
  • Patricia Hersh
چکیده

Geometric lattices are characterized as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are shown to be exactly those finite lattices such that every ordering on the join-irreducibles induces a lexicographic shelling. This new characterization fits into a similar paradigm as McNamara’s characterization of supersolvable lattices as those lattices admitting a different type of lexicographic shelling, namely one in which each maximal chain is labeled with a permutation of {1, . . . , n}.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matroid Shellability , β - Systems and Affine Hyperplane Arrangements

The broken circuit complex plays a fundamental role for the shellability and homology of matroids, geometric lattices and linear hyperplane arrangements. Here we introduce and study the β-system of a matroid, βnbc(M), whose cardinality is Crapo’s β-invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices and affine hyperplane arrangements, we find th...

متن کامل

Shellable Nonpure Complexes and Posets. I

The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have the same dimension). The usefulness of this level of generality was suggested by certain examples coming from the theory of subspace arrangements. We develop several of the basic properties of the concept of nonpure shellability. Doubly indexed f -vectors and h-vector...

متن کامل

Shellability of Noncrossing Partition Lattices

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type Dn and those of exceptional type and rank at least three.

متن کامل

Rees products and lexicographic shellability

We use the theory of lexicographic shellability to provide various examples in which the rank of the homology of a Rees product of two partially ordered sets enumerates some set of combinatorial objects, perhaps according to some natural statistic on the set. Many of these examples generalize a result of J. Jonsson, which says that the rank of the unique nontrivial homology group of the Rees pr...

متن کامل

A Note on Shellability of Hypergraph Arrangements

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown to have shellable intersection lattices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 123  شماره 

صفحات  -

تاریخ انتشار 2014